Finite model theory - PDFSEARCH.IO - Document Search Engine

Finite model theory
Results: 870

#	Item
201	Computational approaches to analyze complex dynamic systems: model-checking and its applications. Part 3: Model-checking of timed transitions systems: timed extensions of Petri nets Morgan Magnin Add to Reading List Source URL: www.nii.ac.jp Language: English - Date: 2013-04-09 03:06:25 Concurrency Applied mathematics Diagrams Petri net Automata theory Formal verification Finite-state machine Petri Model checking Models of computation Theoretical computer science Computer science
202	Computational approaches to analyze complex dynamic systems: model-checking and its applications. Part 2: Model-checking of timed transitions systems Add to Reading List Source URL: www.nii.ac.jp Language: English - Date: 2013-04-03 20:03:57 Computer science Automata theory Concurrency Diagrams Petri net Formal verification Temporal logic Finite-state machine Modal logic Models of computation Applied mathematics Theoretical computer science
203	Computational approaches to analyze complex dynamic systems: model-checking and its applications. Part 4: Models and algorithms to analyze large-scale concurrent systems: approaches inspired by pi-calculus and static ana Add to Reading List Source URL: www.nii.ac.jp Language: English - Date: 2013-04-15 19:28:16 Applied mathematics Theoretical computer science Automata theory Systems Petri net Formal verification Finite-state machine Algorithm Dynamical system Models of computation Concurrency Computer science
204	BOSZ - Boussinesq Ocean & Surf Zone model Volker Roeber1 Troy W. Heitmann2, Kwok Fai Cheung2, Gabriel C. David3, Jeremy D. Bricker1 1International 2 Add to Reading List Source URL: coastal.usc.edu Language: English - Date: 2015-02-23 16:15:20 Water waves Group theory Boussinesq approximation Finite difference Derivative Vector space Algebra Mathematics Mathematical analysis
205	A Logic-based Approach to Decision Making Magdalena Ivanovska∗ and Martin Giese∗ Abstract We propose a novel approach to the well-studied problem of making a finite, ordered sequence of decisions under uncertainty. M Add to Reading List Source URL: www.nik.no Language: English - Date: 2012-02-29 03:37:49 Boolean algebra Model theory Logical syntax Metalogic Function Interpretation Propositional formula Bayesian network Influence diagram Logic Mathematical logic Propositional calculus
206	University of Scranton ACM Student Chapter / Computing Sciences Department 21st Annual High School Programming Contest (2011) -----------------------------------------------------------------------------Problem 1: Arithm Add to Reading List Source URL: www.cs.uofs.edu Language: English - Date: 2012-03-12 15:15:12 Finitary relation RSA Mathematics FO Finite model theory
207	‘Throughout my practice consistent themes and forms emerge; I am repeatedly drawn to the complexity and beauty of the microscopic architecture of living organisms. Whilst also being moved by the experience of space wit Add to Reading List Source URL: sabbiagallery.com Language: English - Date: 2013-08-14 10:49:36 Structure Finite model theory Holism Complexity classes Complex systems theory Diatom FO Complexity Minimalism Systems Modern art Art history
208	Context made visible: On the structure of quantified noun phrases Kathryn Davidson (Yale) and Deanna Gagne (UConn) Sign languages sometimes make visible aspects of structure that are covert in spoken languages. Here we a Add to Reading List Source URL: nels45.mit.edu Language: English - Date: 2014-10-28 01:12:16 Semantics Finite model theory Syntactic categories Quantification Predicate logic Determiner Interpretation FO Domain Logic Theoretical computer science Linguistics
209	Querying Schemas With Access Restrictions Michael Benedikt Pierre Bourhis Clemens Ley Add to Reading List Source URL: vldb.org Language: English - Date: 2012-03-24 02:44:30 Model theory Finite model theory Programming paradigms Conjunctive query Database theory FO Linear temporal logic Datalog First-order logic Theoretical computer science Mathematical logic Mathematics
210	A Type System for Expressive Security Policies∗ David Walker Cornell University Strong type systems such as those of Java or ML provide provable guarantees about the run-time behaviour of programs. If we type check pro Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 1999-11-02 01:07:11 Logic Mathematical logic First-order logic Model theory Predicate logic Symbol Computability Finite-state machine Linear temporal logic Automata theory Models of computation Theoretical computer science

UPDATE